منابع مشابه
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملThe Complexity of Geometric Graph Isomorphism
We study the complexity of Geometric Graph Isomorphism, in l2 and other lp metrics: given two sets of n points A,B ⊂ Q in k-dimensional euclidean space the problem is to decide if there is a bijection π : A→ B such that for all x, y ∈ A, d(x, y) = d(π(x), π(y)), where d is the distance given by the metric. Our results are the following: • We describe algorithms for isomorphism and canonization ...
متن کاملA Geometric Approach to Graph Isomorphism
We present an integer linear program (IP), for the Graph Isomorphism (GI) problem, which has non-empty feasible solution if and only if the input pair of graphs are isomorphic. We study the polytope of the convex hull of the solution points of IP, denoted by B. Exponentially many facets of this polytope are known. We show that in case of non-isomorphic pairs of graphs if a feasible solution exi...
متن کاملGroups, Graphs, Algorithms: The Graph Isomorphism Problem∗
Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1997
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(97)00014-5